Minimal de Bruijn Sequence in a Language with Forbidden Substrings
نویسندگان
چکیده
Let be the following strategy to construct a walk in a labeled digraph: at each vertex, we follow the unvisited arc of minimum label. In this work we study for which languages, applying the previous strategy over the corresponding de Bruijn graph, we finish with an Eulerian cycle, in order to obtain the minimal de Bruijn sequence of the language.
منابع مشابه
ar X iv : 0 71 1 . 16 95 v 1 [ m at h . C O ] 1 2 N ov 2 00 7 Minimum de Bruijn Sequence in a Language with Forbidden Substrings
Let be the following strategy to construct a walk in a labeled digraph: at each vertex, we follow the unvisited arc of minimum label. In this work we study for which languages, applying the previous strategy over the corresponding de Bruijn graph, we finish with an Eulerian cycle, in order to obtain the minimal de Bruijn sequence of the language.
متن کاملDe Bruijn sequences and De Bruijn graphs for a general language
A de Bruijn sequence over a finite alphabet of span n is a cyclic string such that all words of length n appear exactly once as factors of this sequence. We extend this definition to a subset of words of length n, characterizing for which subsets exists a de Bruijn sequence. We also study some symbolic dynamical properties of these subsets extending the definition to a language defined by forbi...
متن کاملA Better Upper Bound on the Bisection Width of de BruijnNetworks (
We approach the problem of bisectioning the de Bruijn network into two parts of equal size and minimal number of edges connecting the two parts (cross-edges). We introduce a general method that is based on required substrings. A partition is deened by taking as one part all the nodes containing a certain string and as the other part all the other nodes. This leads to good bisections for a large...
متن کاملPractical algorithms to rank necklaces, Lyndon words, and de Bruijn sequences
We present practical algorithms for ranking k-ary necklaces and Lyndon words of length n. The algorithms are based on simple counting techniques. By repeatedly applying the ranking algorithms, both necklaces and Lyndon words can be efficiently unranked. Then, explicit details are given to rank and unrank the length n substrings of the lexicographically smallest de Bruijn sequence of order n.
متن کاملBinary De Bruijn cycles under different equivalence relations
De Bruijn cycles are cyclic binary strings of length n where all substrings of length i are distinct. We present a generalization called (', i)-De Bruijn cycles that are defined for an equivalence relation ' on substrings of length i. In this paper, binary (', i)-De Bruijn cycles under the equivalences of cyclic rotation, inverses, and flipping are examined. For the first two equivalences, we p...
متن کامل